Geometric Manifold Energy and Manifold Clustering
نویسندگان
چکیده
A general nonparametric technique is proposed for the description of geometric manifold energy of unorganized data. Minimizing the energy leads to an optimal cycle, from which underlying manifolds are easily distinguished. We design a new framework for manifold clustering based on energy minimization. In addition, we propose the active tabu search method to approximately solve for the optimal solution to energy minimization. We have applied the proposed technique to both synthetic and real data. Experimental results show that the method is feasible and promising in manifold clustering.
منابع مشابه
Evolution of the first eigenvalue of buckling problem on Riemannian manifold under Ricci flow
Among the eigenvalue problems of the Laplacian, the biharmonic operator eigenvalue problems are interesting projects because these problems root in physics and geometric analysis. The buckling problem is one of the most important problems in physics, and many studies have been done by the researchers about the solution and the estimate of its eigenvalue. In this paper, first, we obtain the evol...
متن کاملThe geometric properties of a degenerate parabolic equation with periodic source term
In this paper, we discuss the geometric properties of solution and lower bound estimate of ∆um−1 of the Cauchy problem for a degenerate parabolic equation with periodic source term ut =∆um+ upsint. Our objective is to show that: (1)with continuous variation of time t, the surface ϕ = [u(x,t)]mδq is a complete Riemannian manifold floating in space RN+1and is tangent to the space RN at ∂H0(t); (2...
متن کاملON THE LIFTS OF SEMI-RIEMANNIAN METRICS
In this paper, we extend Sasaki metric for tangent bundle of a Riemannian manifold and Sasaki-Mok metric for the frame bundle of a Riemannian manifold [I] to the case of a semi-Riemannian vector bundle over a semi- Riemannian manifold. In fact, if E is a semi-Riemannian vector bundle over a semi-Riemannian manifold M, then by using an arbitrary (linear) connection on E, we can make E, as a...
متن کاملAn Information Geometric Framework for Dimensionality Reduction
This report concerns the problem of dimensionality reduction through information geometric methods on statistical manifolds. While there has been considerable work recently presented regarding dimensionality reduction for the purposes of learning tasks such as classification, clustering, and visualization, these methods have focused primarily on Riemannian manifolds in Euclidean space. While su...
متن کاملData Clustering by Laplacian Regularized `-Graph
`-Graph has been proven to be effective in data clustering, which partitions the data space by using the sparse representation of the data as the similarity measure. However, the sparse representation is performed for each datum separately without taking into account the geometric structure of the data. Motivated by `-Graph and manifold leaning, we propose Laplacian Regularized `-Graph (LR`-Gra...
متن کامل